Playing with Maude
نویسندگان
چکیده
This paper is an introduction to rule-based programming in Maude. We illustrate in particular the use of operator attributes to structure the state of a system, and the difference between equations and rules. We use well-known mathematical games and puzzles for our examples illustrating the expressive power of Maude.
منابع مشابه
On Agile Service-oriented Business Processes: Activity-centric ECA-Architectural Foundation with Aspectual .Net Environment
With the maturing of service technology, most of organizations are implementing their process-centric information systems using Web-Services (shortly SO-BPs). Nevertheless, still challenging engineering problems are hindering the development of highly adaptive, correct and realistic composite services. We aim contributing by adopting a fine-grained activity-based perception, where we behavioral...
متن کاملNew evaluation commands for Maude within Full Maude 1
Maude is able to deal with infinite data structures and avoid infinite computations by using strategy annotations. However, they can eventually make the computation of the normal form(s) of some input expressions impossible. We have used Full Maude to implement two new commands norm and eval which furnish Maude with the ability to compute (constructor) normal forms of initial expressions even w...
متن کاملMaude: Speciication and Programming in Rewriting Logic ?
Maude is a high-level language and a high-performance system supporting exe-cutable speciication and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational speciication and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that ha...
متن کاملK-Maude: A Rewriting Based Tool for Semantics of Programming Languages
K is a rewriting-based framework for defining programming languages. K-Maude is a tool implementing K on top of Maude. K-Maude provides an interface accepting K modules along with regular Maude modules and a collection of tools for transforming K language definitions into Maude rewrite theories for execution or analysis, or into LaTeX for documentation purposes. The current K-Maude prototype wa...
متن کاملUnification and Narrowing in Maude 2.4
Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications, and has a relatively large worldwide user and open-source developer base. This paper introduces novel features of Maude 2.4 including support for unification and narrowing. Unification is supported in Core Maude, the core rewri...
متن کامل